A Simple Dissortative Bipartite Network Model
نویسندگان
چکیده
In this paper, we propose and study a simple bipartite network model. Significantly, we prove that the degree distribution of one kind nodes obey power-law form with adjustable exponents. And the other obeys exponential distribution. Furthermore, we study the degree-degree correlation of the model by calculating the mixing coefficient and find that the network model is dissortative. Numerical simulations results are given to verify the theoretical results.
منابع مشابه
From Assortative to Dissortative Networks: the Role of Capacity Constraints
We consider a dynamic model of network formation where agents form and sever links based on the centrality of their potential partners. We show that the existence of capacity constrains in the amount of links an agent can maintain introduces a transition from dissortative to assortative networks. This effect can shed light on the distinction between technological and social networks as it gives...
متن کاملOn the Conduciveness of Random Network Graphs for Maximal Assortative or Maximal Dissortative Matching
A maximal matching of a graph is the set of edges such that the addition of an edge to this set violates the property of matching (i.e., no two edges of the matching share a vertex). We use the notion of assortative index (ranges from -1 to 1) to evaluate the extent of similarity of the end vertices constituting the edges of a matching. A maximal matching of the edges whose assortative index is...
متن کاملAssortativity Analysis of Real-World Network Graphs based on Centrality Metrics
Assortativity index (A. Index) of real-world network graphs has been traditionally computed based on the degree centrality metric and the networks were classified as assortative, dissortative or neutral if the A. Index values are respectively greater than 0, less than 0 or closer to 0. In this paper, we evaluate the A. Index of real-world network graphs based on some of the commonly used centra...
متن کاملParsimonious module inference in large networks.
We investigate the detectability of modules in large networks when the number of modules is not known in advance. We employ the minimum description length principle which seeks to minimize the total amount of information required to describe the network, and avoid overfitting. According to this criterion, we obtain general bounds on the detectability of any prescribed block structure, given the...
متن کاملBayesian nonparametric models for bipartite graphs
We develop a novel Bayesian nonparametric model for random bipartite graphs. The model is based on the theory of completely random measures and is able to handle a potentially infinite number of nodes. We show that the model has appealing properties and in particular it may exhibit a power-law behavior. We derive a posterior characterization, a generative process for network growth, and a simpl...
متن کامل